منابع مشابه
Chordal Graphs
One can prove the following propositions: (1) For every non zero natural number n holds n − 1 is a natural number and 1 ≤ n. (2) For every odd natural number n holds n − 1 is a natural number and 1 ≤ n. (3) For all odd integers n, m such that n < m holds n ≤ m − 2. (4) For all odd integers n, m such that m < n holds m + 2 ≤ n. (5) For every odd natural number n such that 1 6= n there exists an ...
متن کاملEquistable Chordal Graphs
A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We show that a chordal graphs is equistable if and only if every two adjacent non-simplicial vertices have a common simplicial neighbor.
متن کاملPolarity of chordal graphs
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to decide for general graphs. It has been recently proved that for cographs, the existence of such a partition can be characterized by finitely many forbidden subgraphs, and hence tested in polynomial time. In this paper ...
متن کاملBranchwidth of chordal graphs
This paper revisits the ’branchwidth territories’ of Kloks, Kratochv́ıl and Müller [12] to provide a simpler proof and a faster algorithm for computing branchwidth of an interval graph. We also generalize the algorithm to the class of chordal graphs, albeit at the expense of exponential running time. Compliance with the ternary constraint of the branchwidth definition is facilitated by a simple ...
متن کاملChordal Probe Graphs
In this paper, we introduce the class of chordal probe graphs which are a generalization of both interval probe graphs and chordal graphs. A graph G is chordal probe if its vertices can be partitioned into two sets P (probes) and N (non-probes) where N is a stable set and such that G can be extended to a chordal graph by adding edges between non-probes. We show that chordal probe graphs may con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2006
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2005.08.007